Data placement in write cache architecture supporting read heat data separation

ABSTRACT

A computer-implemented method, according to one approach, includes: determining a current read heat value of each logical page which corresponds to write requests that have accumulated in a destage buffer. Each of the write requests is assigned to a respective write queue based on the current read heat value of each logical page which corresponds to the write requests. Moreover, each of the write queues correspond to a different page stripe which includes physical pages, the physical pages included in each of the respective page stripes being of a same type. Other systems, methods, and computer program products are described in additional approaches.

BACKGROUND

The present invention relates to data storage systems, and moreparticularly, this invention relates to selective data placement inwrite cache architecture which supports read heat data separation.

Using Flash memory as an example, the performance characteristics ofconventional NAND Flash-based solid state drives (SSDs) arefundamentally different from those of traditional hard disk drives(HDDs). Data in conventional SSDs is typically organized in pages of 4,8, or 16 KB sizes. Moreover, page read operations in SSDs are typicallyone order of magnitude faster than write operations and latency neitherdepends on the current nor the previous location of operations.

However, in Flash-based SSDs, memory locations are erased in blocksprior to being written to. The size of an erase block unit is anywherefrom 256, to 512, or even several thousands of pages and the eraseoperations take approximately one order of magnitude more time than apage program operation. Due to the intrinsic properties of NAND Flash,Flash-based SSDs write data out-of-place whereby a mapping table mapslogical addresses of the written data to physical ones. This mappingtable is typically referred to as the Logical-to-Physical Table (LPT).

As Flash-based memory cells exhibit read errors and/or failures due towear or other reasons, additional redundancy may be used within memorypages as well as across memory chips (e.g., RAID-5 and RAID-6 likeschemes). The additional redundancy within memory pages may includeerror correction code (ECC) which, for example, may include BCH, LDPC,or other codes. While the addition of ECC in pages is relativelystraightforward, the organization of memory blocks into RAID-likestripes is more complex. For instance, individual blocks are retiredover time which requires either reorganization of the stripes, orcapacity reduction of the stripe. As the organization of stripestogether with the LPT defines the placement of data, SSDs typicallyutilize a Log-Structured Array (LSA) architecture, which combines thesetwo methods.

Read latency characteristics have continued to increase as memory suchas NAND Flash continues to advance. This is particularly true as thenumber of bits stored per cell increases, as read latency increasesproportionally with the number of read threshold voltages that have tobe applied upon reading the page. Therefore, some conventional NANDFlash architectures exhibit significant latency differences depending onthe page type.

It follows that larger storage systems which target low latency haveexperienced significant challenges as a result of this trend. Forinstance, existing NAND Flash generations with lower latencies willeventually be superseded by newer generations that can store more data,but which also have inferior latency properties. Conventionalcontrollers which are used to manage data stored on such memory are alsofaced with similar challenges.

SUMMARY

A computer-implemented method, according to one approach, includes:determining a current read heat value of each logical page whichcorresponds to write requests that have accumulated in a destage buffer.Each of the write requests is assigned to a respective write queue basedon the current read heat value of each logical page which corresponds tothe write requests. Moreover, each of the write queues correspond to adifferent page stripe which includes physical pages, the physical pagesincluded in each of the respective page stripes being of a same type.

Different types of physical pages experience different amounts of readlatency due to their respective physical construction and the differentresulting processes involved with actually reading data from each ofthem. Accordingly, by establishing a relationship between each of thewrite queues and a respective one of the open page stripes, the systemis able to improve operational efficiency by taking advantage of therelationship identified as existing between read latency and read heat.In other words, the read latency associated with the pages of a givenpage type may be used to select the write queue that is assigned theretobased on the corresponding read heat. In doing so, the approachesincluded herein are able to desirably reduce the overall amount ofprocessing delays experienced by a system as a whole.

Further still, the computer-implemented method in some approachesincludes: receiving a read request which corresponds to data stored inone or more logical pages, and incrementing a read heat value associatedwith each of the one or more logical pages. The read request is alsosatisfied.

Various ones of the approaches included herein are able to achieveselective data placement in write cache architecture which supports readheat data separation. As a result, read latency is significantly reducedfor various types and generations of memory. These approaches are ableto leverage the different latency properties of the different types ofphysical pages in multi-bit-per-cell memory (e.g., such as TLC and QLCNAND Flash) to significantly reduce the read latency experienced by theoverarching data storage system as a whole. These improvements areachieved in some approaches by tracking the read heat of the data storedin memory, and selectively organizing the data in memory according tothe read heat, e.g., as will be described in further detail below.

A computer program product, according to another approach, includes acomputer readable storage medium having program instructions embodiedtherewith. The program instructions are readable and/or executable by aprocessor to cause the processor to perform the foregoing method.

A system, according to yet another approach, includes: a plurality ofnon-volatile random access memory (NVRAM) blocks configured to storedata. The system also includes a processor and logic integrated withand/or executable by the processor. Moreover, the logic is configured toperform the foregoing method.

Other aspects and embodiments of the present invention will becomeapparent from the following detailed description, which, when taken inconjunction with the drawings, illustrate by way of example theprinciples of the invention.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a diagram of a non-volatile memory card, in accordance withone approach.

FIG. 2 is a diagram of a data storage system architecture, in accordancewith one approach.

FIG. 3 is a system diagram, in accordance with one approach.

FIG. 4 is a conceptual diagram which includes a block-stripe andpage-stripe, in accordance with one approach.

FIG. 5A is a partial representational view of a data storage system, inaccordance with one approach.

FIG. 5B is a flowchart of a method, in accordance with one approach.

FIG. 5C is a flowchart of a method, in accordance with one approach.

FIG. 6A is a partial representational view of a data storage system, inaccordance with one approach.

FIG. 6B is a flowchart of a method, in accordance with one approach.

FIG. 7A is a partial representational view of a data storage system, inaccordance with one approach.

FIG. 7B is a flowchart of a method, in accordance with one approach.

FIG. 8 is a network architecture, in accordance with one approach.

FIG. 9 is a representative hardware environment that may be associatedwith the servers and/or clients of FIG. 8, in accordance with oneapproach.

FIG. 10 is a tiered data storage system in accordance with one approach.

DETAILED DESCRIPTION

The following description is made for the purpose of illustrating thegeneral principles of the present invention and is not meant to limitthe inventive concepts claimed herein. Further, particular featuresdescribed herein can be used in combination with other describedfeatures in each of the various possible combinations and permutations.

Unless otherwise specifically defined herein, all terms are to be giventheir broadest possible interpretation including meanings implied fromthe specification as well as meanings understood by those skilled in theart and/or as defined in dictionaries, treatises, etc.

It must also be noted that, as used in the specification and theappended claims, the singular forms “a,” “an” and “the” include pluralreferents unless otherwise specified. It will be further understood thatthe terms “comprises” and/or “comprising,” when used in thisspecification, specify the presence of stated features, integers, steps,operations, elements, and/or components, but do not preclude thepresence or addition of one or more other features, integers, steps,operations, elements, components, and/or groups thereof.

The following description discloses several preferred approaches of datastorage systems, as well as operation and/or component parts thereof. Itshould be appreciated that various approaches herein can be implementedwith a wide range of memory mediums, including for example NVRAMtechnologies such as NAND Flash memory, NOR Flash memory, phase-changememory (PCM), magnetoresistive RAM (MRAM) and resistive RAM (RRAM). Toprovide a context, and solely to assist the reader, various approachesmay be described with reference to a type of non-volatile memory. Thishas been done by way of example only, and should not be deemed limitingon the invention defined in the claims.

In one general approach, a computer-implemented method includes:receiving write requests, accumulating the write requests in a destagebuffer, and determining a current read heat value of each logical pagewhich corresponds to the write requests. Each of the write requests isassigned to a respective write queue based on the current read heatvalue of each logical page which corresponds to the write requests.Moreover, each of the write queues correspond to a different page stripewhich includes physical pages, the physical pages included in each ofthe respective page stripes being of a same type. Furthermore, data inthe write requests is destaged from the write queues to their respectivepage stripes.

In another general approach, a computer program product includes acomputer readable storage medium having program instructions embodiedtherewith. The program instructions are readable and/or executable by aprocessor to cause the processor to: perform the foregoing method.

In yet another general approach, a system includes: a plurality ofnon-volatile random access memory (NVRAM) blocks configured to storedata. The system also includes a processor and logic integrated withand/or executable by the processor. Moreover, the logic is configuredto: perform the foregoing method.

In another general approach, a computer-implemented method includes:receiving write requests, accumulating the write requests in a destagebuffer, and determining whether each of the write requests are a hostwrite request. In response to determining that a write request is not ahost write request, a current read heat value of each logical page whichcorresponds to the write request is determined. The write request isalso assigned to a write queue based on the current read heat value ofeach logical page which corresponds to the write request. Each of thewrite queues correspond to a different page stripe which includesphysical pages, and the physical pages included in each of therespective page stripes are of a same type. However, in response todetermining that a write request is a host write request, the writerequest is assigned to a supplemental write queue.

In still another general approach, a computer program product includes acomputer readable storage medium having program instructions embodiedtherewith. The program instructions are readable and/or executable by aprocessor to cause the processor to: perform the foregoing method.

FIG. 1 illustrates a memory card 100, in accordance with one approach.It should be noted that although memory card 100 is depicted as anexemplary non-volatile data storage card in the present approach,various other types of non-volatile data storage cards may be used in adata storage system according to alternate approaches. It follows thatthe architecture and/or components of memory card 100 are in no wayintended to limit the invention, but rather have been presented as anon-limiting example.

Moreover, as an option, the present memory card 100 may be implementedin conjunction with features from any other approach listed herein, suchas those described with reference to the other FIGS. However, suchmemory card 100 and others presented herein may be used in variousapplications and/or in permutations which may or may not be specificallydescribed in the illustrative approaches listed herein. Further, thememory card 100 presented herein may be used in any desired environment.

With continued reference to FIG. 1, memory card 100 includes a gateway102, a general purpose processor (GPP) 112 (such as an ASIC, FPGA, CPU,etc.) connected to a GPP memory 114 (which may comprise RAM, ROM,battery-backed DRAM, phase-change memory PC-RAM, MRAM, STT-MRAM, etc.,or a combination thereof), and a number of memory controllers 108, whichinclude Flash controllers in the present example. Each memory controller108 is connected to a plurality of NVRAM memory modules 104 (which maycomprise NAND Flash or other non-volatile memory type(s) such as thoselisted above) via channels 106.

According to various approaches, one or more of the controllers 108 maybe or include one or more processors, and/or any logic for controllingany subsystem of the memory card 100. For example, the controllers 108typically control the functions of NVRAM memory modules 104 such as,data writing, data recirculation, data reading, etc. The controllers 108may operate using logic known in the art, as well as any logic disclosedherein, and thus may be considered as a processor for any of thedescriptions of non-volatile memory included herein, in variousapproaches.

Moreover, the controller 108 may be configured and/or programmable toperform or control some or all of the methodology presented herein.Thus, the controller 108 may be considered to be configured to performvarious operations by way of logic programmed into one or more chips,modules, and/or blocks; software, firmware, and/or other instructionsbeing available to one or more processors; etc., and combinationsthereof.

Referring still to FIG. 1, each memory controller 108 is also connectedto a controller memory 110 which preferably includes a cache whichreplicates a non-volatile memory structure according to the variousapproaches described herein. However, depending on the desired approach,the controller memory 110 may be battery-backed dynamic random-accessmemory (DRAM), phase-change memory PC-RAM, MRAM, STT-MRAM, etc., or acombination thereof.

As previously mentioned, memory card 100 may be implemented in varioustypes of data storage systems, depending on the desired approach. FIG. 2illustrates a data storage system architecture 200 according to anexemplary approach which is in no way intended to limit the invention.Moreover, it should be noted that the data storage system 220 of FIG. 2may include various components found in the approach of FIG. 1.

Looking to FIG. 2, the data storage system 220 comprises a number ofinterface cards 202 configured to communicate via I/O interconnections204 to one or more processor systems 201. The data storage system 220may also comprise one or more RAID controllers 206 configured to controldata storage in a plurality of non-volatile data storage cards 208. Thenon-volatile data storage cards 208 may comprise NVRAM, Flash memorycards, RAM, ROM, and/or some other known type of non-volatile memory.

The I/O interconnections 204 may include any known communicationprotocols, such as Fiber Channel (FC), FC over Ethernet (FCoE),Infiniband, Internet Small Computer System Interface (iSCSI), TransportControl Protocol/Internet Protocol (TCP/IP), Peripheral ComponentInterconnect Express (PCIe), etc., and/or any combination thereof.

The RAID controller(s) 206 in the data storage system 220 may perform aparity scheme similar to that employed by RAID-5, RAID-6, RAID-10, orsome other suitable parity scheme, as would be understood by one ofskill in the art upon reading the present descriptions.

Each processor system 201 comprises one or more processors 210 (such asCPUs, microprocessors, etc.), local data storage 211 (e.g., such as RAM914 of FIG. 9, ROM 916 of FIG. 9, etc.), and an I/O adapter 218configured to communicate with the data storage system 220.

Referring again to FIG. 1, memory controllers 108, GPP 112, and/or othercontrollers described herein (e.g., RAID controllers 206 of FIG. 2) maybe able to perform various functions on stored data, depending on thedesired approach. Specifically, memory controllers or GPP 112 mayinclude logic configured to perform any one or more of the followingfunctions, which are in no way intended to be an exclusive list. Inother words, depending on the desired approach, logic of a storagesystem may be configured to perform additional or alternative functions,as would be appreciated by one skilled in the art upon reading thepresent description.

Garbage Collection

Garbage collection in the context of SSD memory controllers of thepresent description may include the process of identifying blocks ofdata to be reclaimed for future usage and relocating all pages that arestill valid therein. Moreover, depending on the specific controllerand/or the respective garbage collection unit of operation, logicalerase blocks (LEBs) may be identified for being reclaimed and/orrelocated. Typically, one LEB corresponds to one block stripe, butalternative implementations may consider a fixed number of block stripesor a single block building a LEB as well.

A physical “block” represents a minimal unit that may be erased onnon-volatile memory, e.g., such as NAND Flash memory, and therebyprepared for writing data thereto. However, a typical garbage collectionunit of operation is often a multiple of the physical blocks ofnon-volatile memory, and is also referred to herein as a LEB. This isdue to the fact that typically RAID-like parity information is added inLEBs. Therefore, in case of a page or block failure data can only berebuilt when all blocks in the LEB are still holding data. Accordingly,the individual blocks from the garbage collection unit can only beerased either individually or in a single unit once all still valid datafrom all blocks in the LEB has been relocated successfully to newlocations. Hence, the full garbage collection units aregarbage-collected as a single unit. Moreover, the size of the LEBdirectly affects the garbage collection induced write amplification. Thelarger the LEB, the more likely it becomes that unrelated data arestored together in the LEB, and therefore more of the LEB data may haveto be relocated upon garbage collection selection.

Frequently, blocks from different dies and/or flash channels are groupedtogether, such that blocks from the same group can be read or written inparallel, thereby increasing overall bandwidth. It is also possible tocombine the previous two methods, and to compose RAID stripes usingblocks from different flash channels that can be accessed in parallel.

It should also be noted that an LEB may include any multiple of thephysical memory block, which is a unit of physical erasure. Moreover,the organization of memory blocks into LEBs not only allows for addingRAID-like parity protection schemes among memory blocks from differentmemory chips, memory planes and/or channels but also allows forsignificantly enhancing performance through higher parallelism. Forinstance, multiple non-volatile memory blocks may be grouped together ina RAID stripe. As will be appreciated by one skilled in the art uponreading the present description, RAID schemes generally improvereliability and reduce the probability of data loss.

According to an exemplary approach, which is in no way intended to limitthe invention, memory controllers (e.g., see 108 of FIG. 1) and/or GPP112 may internally perform a garbage collection. As previouslymentioned, the garbage collection may include selecting a LEB to berelocated, after which all data that is still valid on the selected LEBmay be relocated (e.g., moved). After the still valid data has beenrelocated, the LEB may be erased and thereafter, used for storing newdata. The amount of data relocated from the garbage collected LEBdetermines the write amplification. Moreover, an efficient way to reducethe write amplification includes implementing write heat segregation.

Write Heat Segregation

In the present context, the “write heat” of data refers to the rate(e.g., frequency) at which the data is updated (e.g., rewritten with newdata). Memory blocks that are considered “hot” tend to have a frequentupdated rate, while memory blocks that are considered “cold” have anupdate rate lower than hot blocks.

Tracking the write heat of a logical page may involve, for instance,allocating a certain number of bits in the LPT mapping entry for thepage to keep track of how many write requests the page has seen in acertain time period or window. Typically, host write requests increasethe write heat whereas internal relocation writes decrease the writeheat. The actual increments and/or decrements to the write heat may bedeterministic or probabilistic.

Similarly, read heat may be tracked with a certain number of additionalbits in the LPT for each logical page. To reduce meta-data, read heatcan also be tracked at a physical block level where separate countersper block for straddling and non-straddling reads can be maintained,e.g., as will be described in further detail below with respect to FIGS.5A-7B. However, it should be noted that the number of read requests toand/or read operations performed on a memory block may not come intoplay for write heat segregation when determining the write heat of thememory block for some approaches. For example, if data is frequentlyread from a particular memory block, the high read frequency does notnecessarily mean that memory block will also have a high update rate.Rather, a high frequency of read operations performed on a given memoryblock may denote an importance, value, etc. of the data stored in thememory block.

By grouping memory blocks of the same and/or similar write heat values,write heat segregation may be achieved. In particular, write heatsegregating methods may group hot memory pages together in certainmemory blocks while cold memory pages are grouped together in separatememory blocks. Thus, a write heat segregated LEB tends to be occupied byeither hot or cold data.

The merit of write heat segregation is two-fold. First, performing agarbage collection process on a hot memory block will prevent triggeringthe relocation of cold data as well. In the absence of write heatsegregation, updates to hot data, which are performed frequently, alsoresults in the undesirable relocations of all cold data collocated onthe same LEB as the hot data being relocated. Therefore, the writeamplification incurred by performing garbage collection is much lowerfor approaches implementing write heat segregation.

Secondly, the relative write heat of data can be utilized for wearleveling purposes. For example, hot data may be placed in healthier(e.g., younger) memory blocks, while cold data may be placed on lesshealthy (e.g., older) memory blocks relative to those healthier memoryblocks. Thus, the rate at which relatively older blocks are exposed towear is effectively slowed, thereby improving the overall endurance of agiven data storage system implementing write heat segregation.

Write Allocation

Write allocation includes placing data of write requests into freelocations of open LEBs. As soon as all pages in a LEB have been written,the LEB is closed and placed in a pool holding occupied LEB s.Typically, LEB s in the occupied pool become eligible for garbagecollection. The number of open LEBs is normally limited and any LEBbeing closed may be replaced, either immediately or after some delay,with a fresh LEB that is being opened.

During performance, garbage collection may take place concurrently withuser write operations. For example, as a user (e.g., a host) writes datato a device, the device controller may continuously perform garbagecollection on LEBs with invalid data to make space for the new incomingdata pages. As mentioned above, the LEBs having the garbage collectionbeing performed thereon will often have some pages that are still validat the time of the garbage collection operation; thus, these pages arepreferably relocated (e.g., written) to a new LEB.

Again, the foregoing functions are in no way intended to limit thecapabilities of any of the storage systems described and/or suggestedherein. Rather, the aforementioned functions are presented by way ofexample, and depending on the desired approach, logic of a storagesystem may be configured to perform additional or alternative functions,as would be appreciated by one skilled in the art upon reading thepresent description.

Referring now to FIG. 3, a system 300 is illustrated in accordance withone approach. As an option, the present system 300 may be implemented inconjunction with features from any other approach listed herein, such asthose described with reference to the other FIGS. However, such system300 and others presented herein may be used in various applicationsand/or in permutations which may or may not be specifically described inthe illustrative approaches listed herein. Further, the system 300presented herein may be used in any desired environment, e.g., incombination with a controller.

As illustrated, system 300 includes a write cache 302 which is coupledto several other components, including garbage collector 304. Aspreviously mentioned, garbage collector 304 may be used to free LEBunits by relocating valid data and providing non-volatile memory blocksto be erased for later reuse. Thus, the garbage collector 304 mayreclaim blocks of consecutive physical space, depending on the desiredapproach. According to an exemplary approach, block erase units may beused to keep track of and/or complete the erase of non-volatile memoryblocks handed over by the garbage collector 304.

Write cache 302 is also coupled to free block manager 306 which may keeptrack of free non-volatile memory blocks after they have been erased.Moreover, as would be appreciated by one of ordinary skill in the artupon reading the present description, the free block manager 306 maybuild free stripes of non-volatile memory blocks from different lanes(e.g., block-stripes) using the erased free non-volatile memory blocks.

Referring still to FIG. 3, write cache 302 is coupled to LPT manager 308and memory I/O unit 310. The LPT manager 308 maintains thelogical-to-physical mappings of logical addresses to physical pages inmemory. According to an example, which is in no way intended to limitthe invention, the LPT manager 308 may maintain the logical-to-physicalmappings of 4 KiB or 16 KiB logical addresses. The memory I/O unit 310communicates with the memory chips in order to perform low leveloperations, e.g., such as reading one or more non-volatile memory pages,writing a non-volatile memory page, erasing a non-volatile memory block,etc.

To better understand the distinction between block-stripes andpage-stripes as used herein, FIG. 4 is a conceptual diagram 400, inaccordance with one approach. LEBs are built from block stripes andtypically a single block stripe is used to build a LEB. However,alternative approaches may use multiple block stripes to form an LEB. Asan option, the present conceptual diagram 400 may be implemented inconjunction with features from any other approach listed herein, such asthose described with reference to the other FIGS. However, suchconceptual diagram 400 and others presented herein may be used invarious applications and/or in permutations which may or may not bespecifically described in the illustrative approaches listed herein.Further, the controller conceptual diagram 400 presented herein may beused in any desired environment. Thus, the exemplary non-volatile memorycontroller conceptual diagram 400 of FIG. 4 may be implemented in acache architecture. However, depending on the desired approach, theconceptual diagram 400 of FIG. 4 may be implemented in defining theorganization of data stored in non-volatile memory. Accordingly, bothimplementations are described in turn below.

Non-Volatile Memory

Looking now to FIG. 4, the conceptual diagram 400 includes a set of M+1aggregated planes labeled “Plane 0” through “Plane M”. An aggregatedplane consists of all physical planes with the same plane index ondifferent channels. It should be noted that aggregated planes are alsoreferred to herein simply as planes.

When implemented with data stored in non-volatile memory, each physicalplane on a channel may include a large set of blocks, e.g., typically inthe order of 1024, 2048 or more. Moreover, one or more physical planesmay also include several additional blocks which may be used asreplacement blocks for bad blocks (e.g., blocks performing poorly,blocks having undesirable characteristics, etc.).

In each plane of non-volatile memory, a single block from each channelmay form a respective block-stripe. It follows that a number ofblock-stripes supported by a given approach of non-volatile memory maybe determined by the number of blocks per plane and the number ofplanes.

In the exploded view of Plane 0, the conceptual diagram 400 furtherillustrates a single block-stripe (Block-stripe 0) out of the set ofblock-stripes supported in the remainder of the planes. Block-stripe 0of plane 0 is shown as including 11 blocks, one block from each channellabeled “Channel 0” through “Channel 10”. It should be noted that theassociation of blocks to block-stripe can change over time asblock-stripes are typically dissolved after they have been garbagecollected. Erased blocks may be placed in free block pools, whereby newblock-stripes are assembled from blocks in the free block pools whenwrite allocation requests fresh block-stripes. For example, looking toconceptual diagram 400, Block 10 from Channel 0 and Block 41 fromChannel 4 are currently associated with the illustrated Block-stripe 0of Plane 0. Furthermore, the illustrated Block-stripe 0 holds N+1page-stripes and each block therefore holds N+1 pages labeled “Page 0”through “Page N”.

Cache Architecture

Referring still to FIG. 4, each block of pages illustrated in theexploded view of aggregated Plane 0 may constitute a unique block fromone channel when implemented in a cache architecture. Similarly, eachchannel contributes a single, individual block which form ablock-stripe. For example, looking to conceptual diagram 400, Block 10from Channel 0 includes all pages (Page 0 through Page N) therein, whileBlock 41 from Channel 4 corresponds to all pages therein, and so on.

In the context of a memory controller, e.g., which may be capable ofimplementing RAID at the channel level, a block-stripe is made up ofmultiple blocks which amount to a stripe of blocks. Looking still toFIG. 4, the multiple blocks of aggregated Plane 0 constituteBlock-stripe 0. While all blocks in a block-stripe typically belong tothe same aggregated plane, in some approaches one or more blocks of ablock-stripe may belong to different physical planes. It follows thateach aggregated plane may include one or more block-stripe. Thus,according to an illustrative approach, Block 0 through Block 10 fromdifferent physical planes may constitute a block-stripe.

Regardless of whether the conceptual diagram 400 of FIG. 4 isimplemented with non-volatile memory and/or a cache architecture, indifferent approaches, the number of pages in each block and/or thenumber of channels in each plane may vary depending on the desiredapproach. According to an exemplary approach, which is in no wayintended to limit the invention, a block may include 256 pages, butcould include more or less in various approaches. Analogously, thenumber of channels per plane and/or the number of planes may varydepending on the desired approach.

Referring still to FIG. 4, all pages in a block-stripe with the samepage index denote a page-stripe. For example, Page-stripe 0 includes thefirst page (Page 0) of each channel in Block-stripe 0 of Plane 0.Similarly, Page-stripe N includes the last page (Page N) of each channelin Block-stripe 0 of Plane 0.

As previously mentioned, read latency characteristics have continued toincrease as memory such as NAND Flash continues to advance. This isparticularly true as the number of bits stored per cell increases, asread latency increases proportionally with the number of read thresholdvoltages that have to be applied upon reading the page. Therefore, someconventional NAND Flash architectures exhibit significant latencydifferences depending on the page type. For example, whiletwo-dimensional (2D) multi-level cell (MLC) memory experiences anaverage read latency in the range of 50 to 100 microseconds (μs),three-dimensional (3D) triple-level cell (TLC) memory experiences anaverage read latency increase of about 1.4 times that experienced by MLCmemory. Furthermore, 3D quad-level cell (QLC) memory experiences anaverage read latency increase of about 2.5 times that experienced by MLCmemory.

It follows that larger storage systems which target low latency haveexperienced significant challenges as a result of this trend. Forinstance, existing NAND Flash generations with lower latencies willeventually be superseded by newer generations that can store more data,but which also have inferior latency properties. Conventionalcontrollers which are used to manage data stored on such memory are alsofaced with similar challenges.

In sharp contrast to these conventional shortcomings, various ones ofthe approaches included herein are able to achieve selective dataplacement in write cache architecture which supports read heat dataseparation. As a result, read latency is significantly reduced forvarious types and generations of memory. These improvements areachieved, at least in part, as a result of identifying that real-worldworkloads are typically skewed. In other words, while a portion of thedata stored in memory is read relatively frequently, other portions ofdata are rarely read. Write operations are also skewed in a similarmanner. Further, frequently updated portions of data typically do notoverlap with portions of data which are frequently read. In other words,a significant portion of data is written to memory once and subsequentlyread often, while other portions of data is frequently overwritten yetrarely read, e.g., such as logs.

Accordingly, various ones of the approaches included herein are able toleverage the different latency properties of the different types ofphysical pages in multi-bit-per-cell memory (e.g., such as TLC and QLCNAND Flash) to significantly reduce the read latency experienced by theoverarching data storage system as a whole. These improvements areachieved in some approaches by tracking the read heat of the data storedin memory, and selectively organizing the data in memory according tothe read heat, e.g., as will be described in further detail below.

These improvements in read latency may be achieved by a number ofdifferent memory configurations and/or controller architectures thatsupport read heat separation. For example, some of the approachesdescribed herein are implemented in controller architectures whichmanage memory that is only configured in multi-bit-per-cell mode. Yetother ones of the approaches presented herein are implemented in hybridcontroller architectures which manage memory configured in SLC mode aswell as memory configured in multi-bit-per-cell mode. These two memoryconfigurations are also implemented in a same storage device in someapproaches.

According to one such approach, which is in no way intended to limit theinvention, FIG. 5A depicts a data storage system 500 which implements acontroller architecture that manages memory that is only configured inmulti-bit-per-cell mode. As an option, the present data storage system500 may be implemented in conjunction with features from any otherapproaches listed herein, such as those described with reference to theother FIGS., such as FIGS. 1-4. However, such data storage system 500and others presented herein may be used in various applications and/orin permutations which may or may not be specifically described in theillustrative approaches listed herein. Further, the data storage system500 presented herein may be used in any desired environment. Thus FIG.5A (and the other FIGS.) may be deemed to include any possiblepermutation.

As show, the data storage system 500 includes a read heat separationunit 502 which is coupled to a read heat counter module 504 as well as adestage buffer 506. The read heat separation unit 502 is also coupled toa number of write queues 508, 510, 512, 514 which are included in amemory module 516. Moreover, each of the write requests which haveaccumulated in the write queues 508, 510, 512, 514 correspond to ashaded one of the entry locations in the destage buffer 506.

The aforementioned components in the data storage system 500 aredepicted as being implemented in a controller 518 according to thepresent approach. However, this is in no way intended to limit theinvention. For instance, in other approaches a controller may simply becoupled to the read heat separation unit 502, the read heat countermodule 504, the destage buffer 506, and/or the memory module 516, e.g.,such that commands, requests, instructions, etc. may be transferredtherebetween.

Over time, the read heat separation unit 502 receives write requestsfrom one or more hosts, running applications, other storage systems,etc. These write requests are typically either new write requests (alsoreferred to herein as “host write requests”) or relocate write requests.New write requests involve writing new data to memory for a first time,while relocate write requests involve rewriting data that is alreadystored in memory. These write requests are received and screened by theread heat separation unit 502, preferably such that appropriate actionmay be taken based on what type of write request has been received(e.g., see method 550 of FIG. 5B below).

With continued reference to FIG. 5A, each of the write queues 508, 510,512, 514 are depicted as corresponding to a respective open block stripe528 consisting of the exemplary page stripes 520, 522, 524, 526 inphysical memory 532. Each of these open page stripes 520, 522, 524, 526extend across a number of blocks 530 of non-volatile memory (e.g., suchas NAND Flash), and page within a page stripe 520, 522, 524, 526 are ofthe same page type. According to an example, which is in no way intendedto limit the invention, the memory 532 is 3D QLC memory which includesfour different types of pages due to the physical construction of thememory cells therein. These page types include lower pages, upper pages,extra pages, and top pages, each of which have different performancecharacteristics. The page type within blocks and their respectivesequence arrangements are related to the non-volatile memory (e.g., NANDflash memory) device structure which can vary between device generationsand manufacturers. But pages with the same page index within a blocktypically are of the same type. For instance, different types ofphysical pages experience different amounts of read latency due to theirrespective physical construction and the different resulting processesinvolved with actually reading data from each of them, e.g., as would beappreciated by one skilled in the art after reading the presentdescription. However, according to another example, the memory 532 is 3DTLC memory which includes three different types of pages due to thephysical construction of the memory cells therein.

By establishing a relationship between each of the write queues 508,510, 512, 514 and a respective one of the open page stripes 520, 522,524, 526, the system 500 is able to improve operational efficiency bytaking advantage of the relationship identified as existing between readlatency and read heat. In other words, the read latency associated withthe pages of a given page type may be used to select the write queuethat is assigned thereto based on the corresponding read heat. In doingso, the approaches included herein are able to desirably reduce theoverall amount of processing delays experienced by the system 500 as awhole. It follows that typically the number of read heat dependent writequeues that are implemented preferably matches the number of page typespresent in the NAND flash memory blocks.

According to an example, which is in no way intended to limit theinvention, open page stripe 520 extends across a number of blocks 530where all of the pages included in open page stripe 520 are lower pagesin QLC memory. Because lower pages are characterized as having a lowestaverage read latency in comparison to the other types of pages thatexist in QLC memory, open page stripe 520 is preferably assigned to awrite queue designated for write requests that involve data havinghigher (e.g., hotter) read heats. Accordingly, the data written in openpage stripe 520 will likely experience a high number of read operations,but the lower average read latency which corresponds to the type ofpages on which the data is stored will counteract this high number ofread operations.

In another example, which is again no way intended to limit theinvention, open page stripe 524 extends across a number of blocks whereall of the pages included in open page stripe 524 are extra pages in QLCmemory. Because extra pages are characterized as having a second highestaverage read latency in comparison to the other types of pages thatexist in QLC memory, open page stripe 524 is preferably assigned to awrite queue designated for write requests that involve data havingsecond lowest (e.g., second coldest) read heats. Accordingly, the datawritten in open page stripe 524 will likely experience a relatively lownumber of read operations, which will counteract the relatively higherread latency involved with actually conducting a read operation on suchpages.

It follows that various ones of the approaches included herein are ableto reduce the overall amount of read latency experienced. Again, this isaccomplished (at least in part) by correlating select types of physicalpages in memory with data having select read heats associated therewith.As a result, this allows for the system to compensate for physical pagesin memory having higher read latencies by storing data having lower readheats therein, as well as take advantage of physical pages in memoryhaving lower read latencies by storing data having higher read heatstherein.

Moreover, looking now to FIG. 5B, a flowchart of a method 550 forstoring data in memory according to the aforementioned data storagescheme is shown according to one approach. It should be noted that theprocesses included in method 550 have been described with respect to thecontroller architecture introduced in the data storage system 500 ofFIG. 5A. In other words, the various processes included in method 550may be performed by the controller 518 in FIG. 5A in response toreceiving write requests, e.g., as will soon become apparent. However,method 550 may be performed in accordance with the present invention inany of the environments depicted in FIGS. 1-4, among others, in variousapproaches. Of course, more or less operations than those specificallydescribed in FIG. 5B may be included in method 550, as would beunderstood by one of skill in the art upon reading the presentdescriptions.

Each of the steps of the method 550 may be performed by any suitablecomponent of the operating environment. For example, in variousapproaches, the method 550 may be partially or entirely performed by acontroller, a processor, a computer, etc., or some other device havingone or more processors therein. Thus, in some approaches, method 550 maybe a computer-implemented method. In such approaches, the computer usedto implement the method may include the non-volatile memory card itselfor a portion thereof such as the controller, the non-volatile memory, anexternal host, a server, etc. Moreover, the terms computer, processorand controller may be used interchangeably with regards to any of theapproaches herein, such components being considered equivalents in themany various permutations of the present invention.

Moreover, for those approaches having a processor, the processor, e.g.,processing circuit(s), chip(s), and/or module(s) implemented in hardwareand/or software, and preferably having at least one hardware componentmay be utilized in any device to perform one or more steps of the method550. Illustrative processors include, but are not limited to, a centralprocessing unit (CPU), an application specific integrated circuit(ASIC), a field programmable gate array (FPGA), etc., combinationsthereof, or any other suitable computing device known in the art.

As shown in FIG. 5B, operation 552 of method 550 includes receivingwrite requests. In some approaches, new write requests and relocatewrite requests are received by a read heat separation unit (e.g., see502 of FIG. 5A). Moreover, depending on the approach, the write requestsmay be received from one or more hosts, running applications, other datastorage systems over a network, etc. Moreover, the write requests whichare received are typically either new write requests (also referred toherein as “host write requests”) or an internal relocate write requests.As mentioned above, new write requests involve writing new data tomemory for a first time, while relocate write requests involve rewritingdata that is already stored in memory.

According to an example in the context of the data storage system ofFIG. 5A, a relocate write request involves relocating data stored in oneor more physical pages of QLC memory 532 to one or more differentphysical pages of QLC memory 532. However, the relocate write requestinvolves relocating data stored in one or more physical pages of SLCmemory to one or more different physical pages of SLC memory in anotherexample (e.g., see method 750 below), or relocating data between one ormore physical pages of SLC memory and one or more physical pages of QLCmemory in yet another example (e.g., see method 750 below).

Referring back to method 550, the flowchart proceeds to operation 554which includes accumulating the write requests that are received in adestage buffer. Depending on the approach, the destage buffer may beimplemented using MRAM, battery backed DRAM, etc., or any other desiredtype of memory. Moreover, each of the write requests are acknowledged inoperation 556. Depending on the approach, a write request may beacknowledged by returning a message to a source of the write request,indicating that the write request has been added to the destage buffer,updating a LPT, etc.

Operation 558 further includes determining a current read heat value ofeach logical page which corresponds to the data reference by the writerequests. In other words, each of the write requests include and/orcorrespond to specific portions of data. In approaches involvingrelocate write requests, the data specified in the write requestscorresponds to data that is already stored in memory. Moreover, thelogical pages which the data specified in the write requests are storedin have read heats associated therewith (e.g., see read heat countermodule 504 in FIG. 5A). Accordingly, operation 558 includes determininga current read heat value that is associated with the data specified inthe write requests.

With continued reference to method 550 of FIG. 5B, operation 560includes assigning each of the write requests to a respective writequeue based on the current read heat value of each logical page whichcorresponds to the write requests. As described above, each of the writequeues correspond to a different page type which includes physicalpages, and the physical pages included in each of the respective pagestripes are of a same type. Accordingly, each of the write queues arepaired with a respective type of physical pages in memory. Thiscorrelation is preferably established based on a relationship betweenread heat and read latency. Again, the read latency associated with thetype of physical pages in a given page stripe may be used to select thewrite queue that is assigned thereto based on the corresponding readheat. In doing so, some of the approaches included herein are able tocompensate for physical pages in memory having higher read latencies bystoring data having lower read heats therein, as well as take advantageof physical pages in memory having lower read latencies by storing datahaving higher read heats therein. As a result, the approaches are ableto desirably reduce the overall amount of processing delays experiencedas a whole.

Furthermore, decision 562 includes determining whether any of the writequeues include a sufficient number of write requests to fill arespective page stripe in memory which corresponds thereto. When writingto memory, it is desirable that the entire page stripe is filled suchthat storage capacity is efficiently utilized. However, the process offilling a given page stripe may vary depending on the particularapproach. In some approaches decision 562 may involve determiningwhether any of the write queues include a sufficient number of writerequests such that the data included therein is able to fill apredetermined amount of a corresponding page stripe in memory.

For example, decision 562 may involve determining whether any of thewrite queues include a sufficient number of write requests such that thedata included therein would utilize 95% of the storage capacity of acorresponding page stripe in memory when stored therein. While it ispreferred that each page stripe is completely filled when written to,write requests from one or more other write queues may be used to fillin a remaining portion of the given page stripe. According to theexample above, the remaining 5% of the corresponding page stripe inmemory may be filled by write requests accumulated in an adjacent writequeue, thereby increasing the efficiency by which the storage capacityis utilized.

If follows that the specific determination made in decision 562 may varydepending on the particular approach. For instance, the write queues508, 510, 512, 514 may be filled at different rates. However, in a blockpages should be programmed in a specific order without skipping anypages in order to achieve efficient performance and reliability.Furthermore, for a given open block stripe, the number pages of eachpage type is predetermined by the physical architecture of the memorydevice. Accordingly, rather than waiting for new write requests toaccumulate in a given write queue, other options of destaging the dataare available. For instance, operation 560 may include placing writerequests in suboptimal write queues to better balance the write requestqueues.

In another example, operation 564 may include repurposing write requestsfrom an adjacent write queue when an insufficient number of writerequests remain in the directly associated write queue. According tosome approaches, in response to determining a given write queue does notinclude enough data in the respective write requests to fill the nextpage stripe which corresponds thereto, a determination is made as towhether an adjacent write queue includes enough data in the respectivewrite requests to complete filling the next page stripe whichcorresponds to the given write queue. Moreover, the data in the writerequests is destaged from the given write queue as well as the adjacentwrite queue to the next page stripe which corresponds to the given writequeue in response to determining that the adjacent write queue includesenough data in the respective write requests to complete filling thenext page stripe which corresponds to the given write queue.

Referring still to FIG. 5B, in response to determining that a writequeue does not include a sufficient amount of data in the write requestsfrom the write queues to fill the next page stripe in memory, method 550returns to operation 552 such that additional write requests may bereceived and processed as described herein. However, in response todetermining that a write queue includes a sufficient amount of data inthe write requests to fill the next page stripe in memory, method 550proceeds to operation 564 which includes destaging the data in the writerequests from the write queue to the respective page stripe.

Referring momentarily back to FIG. 5A, for a given open block stripe 528the number of pages of each page type is given by the physicalarchitecture of the non-volatile memory device in some approaches. It istherefore possible that at some point the number of remaining writerequests in one of the write queues 508, 510, 512, 514 is not sufficientto write the next page stripe associated therewith, but overall, thereare a sufficient number of write requests to write a single page stripe.In this case, operation 564 of FIG. 5B may take write requests from anadjacent write queue or any other write queue when no write requests areleft in the directly associated write queue to fill the respective pagestripe. To further reduce the risk of experiencing this situation,operation 560 may even sub-optimally place write requests to betterbalance the queue levels (e.g., by placing the write request in anadjacent write queue or any other write queue when the current writequeue exceeds a threshold). It should also be noted that the process ofdestaging the data in the write requests from the write queue involvesactually performing a write operation. In other words, the act ofdestaging the data in the write requests from the write queue involves(or at least triggers) the data actually being written to the physicalpages in memory, e.g., as would be appreciated by one skilled in the artafter reading the present description.

From operation 564, method 550 also returns to operation 552 such thatadditional write requests may be received and processed as describedherein. It follows that subsequent requests to perform write requestsmay be received before a current destage operation has been successfullyimplemented, which are preferably received and processed, e.g.,according to method 550.

Similarly, read operation requests may be received at any time, e.g.,while a write request is being processed and/or a write operation itselfis being performed. FIG. 5C illustrates a method 570 for evaluating aread request that has been received, in accordance with one approach. Itshould be noted that the method 570 has also been described with respectto the controller architecture introduced in the data storage system 500of FIG. 5A. In other words, the various processes included in method 570may be performed by the controller 518 in FIG. 5A in response toreceiving read requests, e.g., as will soon become apparent. However,method 570 may be performed in accordance with the present invention inany of the environments depicted in FIGS. 1-4, among others, in variousapproaches. Of course, more or less operations than those specificallydescribed in FIG. 5C may be included in method 570, as would beunderstood by one of skill in the art upon reading the presentdescriptions.

Each of the steps of the method 570 may be performed by any suitablecomponent of the operating environment. For example, in variousapproaches, the method 570 may be partially or entirely performed by acontroller, a processor, etc., or some other device having one or moreprocessors therein. The processor, e.g., processing circuit(s), chip(s),and/or module(s) implemented in hardware and/or software, and preferablyhaving at least one hardware component may be utilized in any device toperform one or more steps of the method 570. Illustrative processorsinclude, but are not limited to, a central processing unit (CPU), anapplication specific integrated circuit (ASIC), a field programmablegate array (FPGA), etc., combinations thereof, or any other suitablecomputing device known in the art.

As shown in FIG. 5C, operation 572 of method 570 includes receiving aread request which corresponds to data stored in one or more logicalpages. A read request may be received from a host (e.g., user), arunning application, another storage system, etc., depending on theapproach. Moreover, operation 574 includes incrementing a read heatvalue associated with each of the one or more logical pages whichcorrespond to the received read request. As mentioned above, each of thelogical pages preferably have a read heat value corresponding thereto.Referring momentarily back to FIG. 5A, read heat counter module 504 isresponsible in some approaches for maintaining a current read heat valuefor each logical page in memory. In alternative approaches the countermodule 504 may maintain a single counter for a contiguous range oflogical pages.

Depending on the approach, read heat values may be managed at thelogical level and/or the physical level. For instance, a LPT may includeone or more bits for each logical page indicated therein, where the bitsmaintain the current read heat value for the respective logical page.According to an example, which is in no way intended to limit theinvention, a 2-bit counter is implemented for each logical blockaddress. Each of the 2-bit counters are incremented from a value of 0 toa value of 1 in response to receiving a read request which correspondsto the data stored therein. Moreover, each of the 2-bit counters areincremented from a value of 1 to a value of 2 according to apredetermined probability. For instance, a given 2-bit counter has aprobability of 1/10 (10%) that it will be increased from a value of 1 toa value of 2 in response to receiving a read request which correspondsto the data stored therein. Similarly, each of the 2-bit counters areincremented from a value of 2 to a value of 3 according to anotherpredetermined probability. For instance, a given 2-bit counter has aprobability of 1/100 (1%) that it will be increased from a value of 2 toa value of 3 in response to receiving a read request which correspondsto the data stored therein. Thus, each 2-bit counter is able to maintainan accurate read heat for the data which corresponds thereto withoutsignificantly increasing the amount of metadata stored by the system.

It also follows that in some approaches, the read heat counter module504 has access to a LPT in order to maintain the read heat values forthe logical pages based on the data that is actually included in thephysical pages which correspond thereto. A range of adjacent logicalblock addresses may even be aggregated in some approaches to increasecounter resolution. However, it should be noted that in such situationsthe value of each counter should not be reset upon experiencing anoverwrite of the respective page. Rather, counter values may beperiodically decremented in the background, e.g., according to apredetermined counter management scheme. Other factors may also beconsidered in determining whether the read heat values should be resetupon performing a host write request. These additional factors include,by are in no way limited to, detected workload priorities, storagesystem architecture (e.g., knowing that a log structured array isimplemented), whether periodically aging the read heat information is aviable option, etc.

With respect to approaches which implement read heat values which aremanaged at the physical level, counters may be applied in a number ofdifferent ways. For instance, a high resolution counter may bemaintained for each page type and block in physical memory. In otherwords, 4 counters are implemented for each QLC memory block. In othersituations, a high resolution counter is maintained for each page type,layer, and block. In still other situations, a low resolution countermay be implemented for each fine granular page group of each block. Itfollows that read heat values which are managed by counters at thephysical level could be used to improve detection of data misplacements.The detection of data misplacement can be leveraged at operation 560where write requests are assigned to write queues or used by a garbagecollector (e.g., see 304 of FIG. 3) to relocate such misplaced data.

In still further approaches, any of the counters used to maintain thecurrent read heat values may be any desired type of saturating counters.The read heat counters may also be used to filter sequential scans(e.g., such as internal mitigation read operations, array-levelscrubbing, etc.) and/or calibration reads, e.g., as would be appreciatedby one skilled in the art after reading the present description. Byfiltering sequential scans and/or calibration reads, the read heatcounters are able to avoid read counter values from increasingunintentionally. Further still, in some approaches, counters may beimplemented on both the logical and physical page levels, and can evenbe combined, e.g., as desired.

Referring again to FIG. 5C, method 570 also includes satisfying the readrequest by reading the data and providing it in response to the readrequest that was initially received. See operation 576. For example, theinitial read request may have been received from a host whereby the dataread from memory is provided (e.g., sent) to the host that issued theread request.

It follows that the various processes included in methods 550 and 570are able to leverage the different latency properties of the differenttypes of physical pages in multi-bit-per-cell memory (e.g., such as MLC,TLC and QLC NAND Flash) to significantly reduce the read latencyexperienced by the overarching data storage system as a whole. Theseimprovements are achieved in some approaches by tracking the read heatof the data stored in memory, and selectively organizing the data inmemory according to the read heat, e.g., according to any of theapproaches above.

Looking now to FIG. 6A, a data storage system 600 which implements acontroller architecture which is similar to that illustrated in FIG. 5Aabove is depicted in accordance with one approach. Specifically, FIG. 6Aillustrates variations of the approach of FIG. 5A depicting severalexemplary configurations within the data storage system 600.Accordingly, various components of FIG. 6A have common numbering withthose of FIG. 5A.

As an option, the present data storage system 600 may be implemented inconjunction with features from any other approaches listed herein, suchas those described with reference to the other FIGS., such as FIGS.1-5A. However, such data storage system 600 and others presented hereinmay be used in various applications and/or in permutations which may ormay not be specifically described in the illustrative approaches listedherein. Further, the data storage system 600 presented herein may beused in any desired environment. Thus FIG. 6A (and the other FIGS.) maybe deemed to include any possible permutation.

As shown, host write requests that are received by the data storagesystem 600 are routed directly into the destage buffer 506 rather thanbeing received by the read heat separation unit 502 as shown in FIG. 5A.This difference in the way host write requests are handled by thecontroller 604 in this approach stems from the fact that host writerequests involve data which does not yet exist in memory (e.g., new dataor overwritten data), and therefore does not have a read heat associatedtherewith. While a read heat counter may be established in the read heatcounter module 504 for each host write request received, read heat doesnot play a role in determining where the data in the host write requestsis ultimately stored in memory. Rather, host write requests areaccumulated in a supplemental write queue 602. It follows that thesupplemental write queue 602 is designated to only store host writerequests, which are then used to fill any gaps in the block stripes thatthe other write queues may not have been able to, e.g., as indicated bythe arrows in FIG. 6A and as will soon become apparent.

Looking now to FIG. 6B, a flowchart of a method 650 for storing data inmemory according to the aforementioned data storage scheme is shownaccording to one approach. It should be noted that the processesincluded in method 650 have been described with respect to thecontroller architecture introduced in the data storage system 600 ofFIG. 6A. In other words, the various processes included in method 650may be performed by the controller 604 in FIG. 6A in response toreceiving write requests, e.g., as will soon become apparent. However,method 650 may be performed in accordance with the present invention inany of the environments depicted in FIGS. 1-5A, among others, in variousapproaches. Of course, more or less operations than those specificallydescribed in FIG. 6B may be included in method 650, as would beunderstood by one of skill in the art upon reading the presentdescriptions.

Each of the steps of the method 650 may be performed by any suitablecomponent of the operating environment. For example, in variousapproaches, the method 650 may be partially or entirely performed by acontroller, a processor, a computer, etc., or some other device havingone or more processors therein. Thus, in some approaches, method 650 maybe a computer-implemented method. In such approaches, the computer usedto implement the method may include the non-volatile memory drive itselfor a portion thereof such as the controller, the non-volatile memory, anexternal host, a server, etc. Moreover, the terms computer, processorand controller may be used interchangeably with regards to any of theapproaches herein, such components being considered equivalents in themany various permutations of the present invention.

Moreover, for those approaches having a processor, the processor, e.g.,processing circuit(s), chip(s), and/or module(s) implemented in hardwareand/or software, and preferably having at least one hardware componentmay be utilized in any device to perform one or more steps of the method650. Illustrative processors include, but are not limited to, a centralprocessing unit (CPU), an application specific integrated circuit(ASIC), a field programmable gate array (FPGA), etc., combinationsthereof, or any other suitable computing device known in the art.

As shown in FIG. 6B, operation 652 of method 650 includes receivingwrite requests. In some approaches, new write requests and relocatewrite requests are received. Accordingly, decision 654 includesdetermining whether each write request is a host write request or arelocate write request. As mentioned above, new write requests involvewriting new data to memory for a first time, while relocate writerequests involve rewriting data that is already stored in memory.

In response to determining that a given write request is a host writerequest, method 650 proceeds to operation 656 which includes storing thehost write request in the destage buffer, e.g., according to any of theapproaches described above. Moreover, operation 658 includes assigningthe host write request in the destage buffer to a supplemental writequeue. As noted above, the supplemental write queue (e.g., see 602 inFIG. 6A) is only used to accumulate host write requests in preferredapproaches.

Moreover, operation 660 includes destaging the data in the host writerequests from the supplemental write queue to physical pages in any ofthe block stripes. As noted above, the data included in host writerequests are preferably used to fill any gaps that the other writequeues may not have been able to. Accordingly, the data in the hostwrite requests may be destaged from the supplemental write queue asdesired, e.g., rather than in response to determining that the queue hasbeen sufficiently filled.

Further still, method 650 includes resetting the current read heatvalues of logical pages which map to the physical pages the data in thehost write requests are destaged to. See operation 662. As noted above,host write requests include data which has not yet been stored inmemory, and therefore does not have a read heat associated therewith. Itfollows that when the data in a host write request is stored in one ormore pages of memory, any previous read heat value associated with theone or more pages that have been overwritten no longer accuratelyrepresent the read heat of the data stored therein now. By resetting thecurrent read heat value of logical pages which map to the physical pagesthe data in the host write requests are destaged to, the host writerequests are able to begin tracking an accurate read heat value, e.g.,as would be appreciated by one skilled in the art after reading thepresent description. This is typically the case when read hot and writehot data sets are substantially different (there is little overlaptherebetween) and/or a log structured array is implemented, e.g., aswould be appreciated by one skilled in the art after reading the presentdescription. However, it should be noted that if the read hot and writehot data sets do have a substantial amount of overlap, read heat valuesmay not be reset in response to performing a host write. Rather, theread heat values may be decremented over time, e.g., according to anytype of predetermined scheme.

From operation 662, method 650 proceeds to operation 663 where it isdetermined if the supplemental write queue is sufficiently full. If itis determined that the supplemental write queue is sufficiently full,method 650 jumps to operation 674, otherwise method 650 returns tooperation 652 such that additional write requests may be received andprocessed as described herein. It follows that subsequent requests toperform write requests may be received before a current destageoperation has been successfully implemented, which are preferablyreceived and processed, e.g., according to method 650.

Returning to decision 654, method 650 proceeds to operation 664 inresponse to determining that a given write request is a relocate writerequest. There, operation 664 includes storing the relocate writerequest in a destage buffer. In other words, the relocate write requestis assigned to the destage buffer. As noted above, depending on theapproach, the destage buffer may be implemented using MRAM, batterybacked DRAM, etc., or any other desired type of memory. Moreover, eachof the write requests are acknowledged in operation 666. Depending onthe approach, a write request may be acknowledged by returning a messageto a source of the write request, indicating that the write request hasbeen added to the destage buffer, updating a LPT, etc.

Operation 668 includes determining a current read heat value of eachlogical page which corresponds to the data reference by the writerequests. Moreover, operation 670 includes assigning each of the writerequests to a respective write queue based on the current read heatvalue of each logical page which corresponds to the write requests. Thismay be achieved according to any of the approaches described above withrespect to operation 560 of method 550. For instance, read heat valuesmay be managed at the logical level (e.g., in an LPT) and/or thephysical level.

Referring still to FIG. 6B, decision 672 includes determining whetherany of the write queues include a sufficient amount of data in the writerequests to fill a respective page stripe in memory which correspondsthereto. When writing to memory, it is desirable that the entire pagestripe is filled such that storage capacity is efficiently utilized.Although it is preferred that each page stripe is completely filled whenwritten to, in some approaches decision 672 may involve determiningwhether any of the write queues include a sufficient amount of data inthe write requests to fill a predetermined amount of a correspondingpage stripe in memory. For example, decision 672 may involve determiningwhether any of the write queues include a sufficient number of writerequests such that the data included therein is able to utilize 95% ofthe storage capacity of a corresponding block stripe in memory. In thisexample, the data in the host write requests that have accumulated in asupplemental write queue may be used to fill the remaining 5% of thecorresponding block stripe in memory, thereby increasing the efficiencyby which the storage capacity is utilized. Alternatively, write requestsfrom an adjacent write queue or any other write queue may be used tofill in the remaining memory as well, e.g., as described above.

In response to determining that a write queue does not include asufficient amount of data in the write requests from the write queues tofill the next page stripe in memory, method 650 may decide to take writerequests from an adjacent write queue or any other write queue when nowrite requests are left in the directly associated write queue to fillthe respective page stripe, but there are still enough write requests tofill a page stripe before returning to operation 652 such thatadditional write requests may be received and processed as describedherein. However, in response to determining that a write queue includesa sufficient amount of data in the write requests to fill a respectivepage stripe in memory, method 650 proceeds to operation 674 whichincludes destaging the data in the write requests from the write queueto the respective page stripe. From operation 674, method 650 alsoreturns to operation 652 such that additional write requests may bereceived and processed as described herein. It follows that subsequentrequests to perform write requests may be received before a currentdestage operation has been successfully implemented, which arepreferably received and processed, e.g., according to method 650.

It follows that the various processes included in method 650 are able toleverage the different latency properties of the different types ofphysical pages in multi-bit-per-cell memory (e.g., such as TLC and QLCNAND Flash) to significantly reduce the read latency experienced by theoverarching data storage system as a whole. These improvements areachieved in some approaches by tracking the read heat of the data storedin memory, and selectively organizing the data in memory according tothe read heat, e.g., according to any of the approaches above.

Looking now to FIG. 7A, a data storage system 700 which implements acontroller architecture which is similar to that illustrated in FIGS. 5Aand 6A above is depicted in accordance with another approach.Specifically, FIG. 7A illustrates variations of the approaches of FIGS.5A and 6A depicting several exemplary configurations within the datastorage system 700. Accordingly, various components of FIG. 7A havecommon numbering with those of FIGS. 5A and 6A.

As an option, the present data storage system 700 may be implemented inconjunction with features from any other approaches listed herein, suchas those described with reference to the other FIGS., such as FIGS. 1-4.However, such data storage system 700 and others presented herein may beused in various applications and/or in permutations which may or may notbe specifically described in the illustrative approaches listed herein.Further, the data storage system 700 presented herein may be used in anydesired environment. Thus FIG. 7A (and the other FIGS.) may be deemed toinclude any possible permutation.

As shown, host write requests that are received by the data storagesystem 700 are routed directly into the destage buffer 506 rather thanbeing received by the read heat separation unit 502. This difference inthe way host write requests are handled by a hybrid controller 704architecture in this approach stems from the fact that host writerequests involve data which does not yet exist in memory, and thereforedoes not have a read heat associated therewith. While a read heatcounter may be established in the read heat counter module 504 for eachhost write request received, read heat does not play a role indetermining where the data in the host write requests is ultimatelystored in memory. Rather, host write requests are accumulated in asupplemental write queue 702. It follows that the supplemental writequeue 702 is designated to only store host write requests, which arethen used to fill page stripes 706 in open block stripe 710 which extendacross memory blocks 708 in SLC memory 712, e.g., as indicated by thearrows in FIG. 7A and as will soon become apparent. It should also benoted that read operations which request data that is stored in SLCmemory 712 has a lowest latency in comparison to read operationsperformed on multi-bit-per-cell memory 528, e.g., such as QLC memory.

Looking now to FIG. 7B, a flowchart of a method 750 for storing data inmemory according to the aforementioned data storage scheme is shownaccording to one approach. It should be noted that the processesincluded in method 750 have been described with respect to the hybridcontroller architecture introduced in the data storage system 700 ofFIG. 7A. In other words, the various processes included in method 750may be performed by the controller 704 in FIG. 7A in response toreceiving write requests, e.g., as will soon become apparent. However,method 750 may be performed in accordance with the present invention inany of the environments depicted in FIGS. 1-5A, among others, in variousapproaches. Of course, more or less operations than those specificallydescribed in FIG. 7B may be included in method 750, as would beunderstood by one of skill in the art upon reading the presentdescriptions.

Each of the steps of the method 750 may be performed by any suitablecomponent of the operating environment. For example, in variousapproaches, the method 750 may be partially or entirely performed by acontroller, a processor, a computer, etc., or some other device havingone or more processors therein. Thus, in some approaches, method 750 maybe a computer-implemented method. In such approaches, the computer usedto implement the method may include the tape drive itself or a portionthereof such as the controller, the tape, an external host, a server,etc. Moreover, the terms computer, processor and controller may be usedinterchangeably with regards to any of the approaches herein, suchcomponents being considered equivalents in the many various permutationsof the present invention.

Moreover, for those approaches having a processor, the processor, e.g.,processing circuit(s), chip(s), and/or module(s) implemented in hardwareand/or software, and preferably having at least one hardware componentmay be utilized in any device to perform one or more steps of the method750. Illustrative processors include, but are not limited to, a centralprocessing unit (CPU), an application specific integrated circuit(ASIC), a field programmable gate array (FPGA), etc., combinationsthereof, or any other suitable computing device known in the art.

As shown in FIG. 7B, operation 752 of method 750 includes receivingwrite requests, while operation 754 includes accumulating the writerequests in a destage buffer. It should also be noted that accumulatingthe write requests in the destage buffer may include any of the same orsimilar approaches as described above with respect to storing writerequests in a destage buffer, as the terms “accumulating” and “storing”are in no way intended to limit the invention.

Depending on the approach, new write requests and/or relocate writerequests may be received. Further still, the relocate write requests mayinvolve relocating data between blocks in SLC memory, between blocks inmulti-bit-per-cell memory, and/or between SLC and multi-bit-per-cellmemory. Accordingly, decision 756 includes determining what type each ofthe write requests are.

In response to determining that a given write request is a host writerequest or a relocate write request which involves relocating databetween different blocks in SLC memory, method 750 proceeds to operation758 which includes assigning the write request in the destage buffer toa supplemental write queue. As noted above, the supplemental write queue(e.g., see 702 in FIG. 7A) is only used to accumulate host writerequests and relocate write request which involves relocating databetween blocks in SLC memory in preferred approaches.

Decision 760 includes determining whether the supplemental write queueinclude a sufficient amount of data in the write requests to fill atleast an open page stripe in SLC memory. When writing to memory, it isdesirable that the entire page stripe is filled such that storagecapacity is efficiently utilized. Although it is preferred that eachpage stripe is completely filled when written to, in some approachesdecision 760 may involve determining whether the supplemental writequeue includes a sufficient amount of data in the write requests to filla predetermined amount of an open page stripe in SLC memory, e.g., asdescribed in the approaches above.

In response to determining that the supplemental write queue does notinclude a sufficient amount of data in the write requests to fill anopen page stripe in SLC memory, method 750 returns to operation 752 suchthat additional write requests may be received and processed asdescribed herein. However, in response to determining that thesupplemental write queue does include a sufficient amount of data in thewrite requests to fill an open page stripe in SLC memory, method 750proceeds to operation 762. There, operation 762 includes destaging thedata in the write requests from the supplemental write queue to physicalpages in an open block stripe in SLC memory. Further still, the currentread heat values of logical pages which map to the physical pages thatthe data in the host write requests are destaged to are preferably resetas described above.

From operation 762, method 750 returns to operation 752 such thatadditional write requests may be received and processed as describedherein. It follows that subsequent requests to perform write requestsmay be received before a current destage operation has been successfullyimplemented, which are preferably received and processed, e.g.,according to method 750.

Returning to decision 756, method 750 proceeds to operation 766 inresponse to determining that a given write request is a relocate writerequest which involves relocating data between blocks inmulti-bit-per-cell memory and/or relocating data from blocks in SLC toblocks in multi-bit-per-cell. Although the multi-bit-per-cell memory maybe 3D QLC memory in some approaches, any type of multi-bit-per-cellmemory may be implemented in any of the approaches described herein. Asshown, operation 766 includes acknowledging each of the write requests.Depending on the approach, a write request may be acknowledged byreturning a message to a source of the write request, indicating thatthe write request has been added to the destage buffer, updating a LPT,etc.

Operation 768 further includes determining a current read heat value ofeach logical page which corresponds to the data reference by the writerequests. Moreover, operation 770 includes assigning each of the writerequests to a respective write queue based on the current read heatvalue of each logical page which corresponds to the write requests. Thismay be achieved according to any of the approaches described above withrespect to operation 560 of method 550. For instance, read heat valuesmay be managed at the logical level (e.g., in an LPT) and/or thephysical level. Optionally, operation 770 may further take into accountthe queue levels of the write queues (e.g., see 508, 510, 512, 514 ofFIG. 7A) to better balance the write queue levels. For instance,operation 770 may include placing the write requests in an adjacentwrite queue or any other write queue when the current write queueexceeds a predetermined threshold.

Referring still to FIG. 7B, decision 772 includes determining whetherthe write queues include a sufficient amount of data in the writerequests to fill the next page stripe in memory which correspondsthereto. When writing to memory, it is desirable that the entire pagestripe is filled such that storage capacity is efficiently utilized.Although it is preferred that each page stripe is completely filled whenwritten to, in some approaches decision 772 may involve determiningwhether any of the write queues include a sufficient amount of data inthe write requests to fill a predetermined amount of a correspondingpage stripe in memory. For example, decision 772 may involve determiningwhether any of the write queues include a sufficient amount of data inthe write requests to utilize 95% of the storage capacity of acorresponding block stripe in memory. In this example, data in the hostwrite requests that have accumulated in a supplemental write queue maybe used to fill the remaining 5% of the corresponding page stripe inmemory, thereby increasing the efficiency by which the storage capacityis utilized. Alternatively, write requests from an adjacent write queueor any other write queue may be used to fill in the remaining memory aswell.

In response to determining that a write queue does not include asufficient amount of data in the write requests to fill the next pagestripe in memory, method 750 returns to operation 752 such thatadditional write requests may be received and processed as describedherein. However, in response to determining that a write queue includesa sufficient amount of data in the write requests to fill a respectivepage stripe in memory, method 750 proceeds to operation 774 whichincludes destaging the data in the write requests from the write queueto the respective page stripe. From operation 774, method 750 alsoreturns to operation 752 such that additional write requests may bereceived and processed as described herein. It follows that subsequentrequests to perform write requests may be received before a currentdestage operation has been successfully implemented, which arepreferably received and processed, e.g., according to method 750.

It follows that the various processes included in method 750 are alsoable to leverage the different latency properties of the different typesof physical pages in multi-bit-per-cell memory (e.g., such as TLC andQLC NAND Flash) to significantly reduce the read latency experienced bythe overarching data storage system as a whole. These improvements areachieved in some approaches by tracking the read heat of the data storedin memory, and selectively organizing the data in memory according tothe read heat, e.g., according to any of the approaches above.

Furthermore, various ones of the approaches included herein are able toleverage the different latency properties of the different types ofphysical pages in multi-bit-per-cell memory (e.g., such as TLC and QLCNAND Flash) to significantly reduce the read latency experienced by theoverarching data storage system as a whole. These improvements areachieved in some approaches by tracking the read heat of the data storedin memory, and selectively organizing the data in memory according tothe read heat, e.g., according to any of the approaches above. Forinstance, data that is frequently read is selectively stored on physicalpages that have a lower intrinsic read latency, while data that isinfrequently read is selectively stored on physical pages with a higherintrinsic read latency. As a result, the overall read latencyexperienced by the data storage system is reduced significantly, therebyincreasing efficiency.

Moreover, systems which implement a hybrid controller architecturehaving blocks of memory operating in SLC and multi-bit-per-cell mode inthe same device is able to achieve improved read latencies from thebeginning of operation. This is because the blocks of memory operatingin SLC mode have a significantly low read latency associated therewithand are used to field host write requests and other types of writerequests which do not have read heat information available. Moreover,data that has been misplaced in the storage system may be detected inthe various approaches described herein. In response to making such adetection, the data may be proactively relocated (e.g., with or withoutresetting the corresponding read heat value) by relocating the misplacedpages themselves, or even the entire block or LEB in some situations.

It should also be noted that while various ones of the approachesincluded herein are able to significantly reduce read latencyexperienced by a given storage system, additional steps may be taken tofurther reduce read latency. For example, orthogonal techniques such asdata compression, horizontal lane straddling, snap reads (e.g., readingpartial physical pages), etc. may be implemented in any of theapproaches herein to further reduce read latency, e.g., in any mannerwhich would be apparent to one skilled in the art after reading thepresent description.

Moreover, although various ones of the approaches are described hereinas correlating each page stripe with a specific write queue, this is inno way intended to limit the invention. For instance, a write queuewhich includes write requests corresponding to data having a given readheat may be used to fill a page stripe which is correlated with a writequeue which includes write requests corresponding to data having asimilar read heat. According to an example, a write queue which includeswrite requests corresponding to data having a hot read heat may be usedto fill a page stripe which is correlated with a write queue whichincludes write requests corresponding to data having a warm read heat.This operational scheme may be implemented in order to free space in thedestage buffer, flush a write queue that is close to becoming full, etc.

The present invention may be a system, a method, and/or a computerprogram product at any possible technical detail level of integration.The computer program product may include a computer readable storagemedium (or media) having computer readable program instructions thereonfor causing a processor to carry out aspects of the present invention.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, configuration data for integrated circuitry, oreither source code or object code written in any combination of one ormore programming languages, including an object oriented programminglanguage such as Smalltalk, C++, or the like, and procedural programminglanguages, such as the “C” programming language or similar programminglanguages. The computer readable program instructions may executeentirely on the user's computer, partly on the user's computer, as astand-alone software package, partly on the user's computer and partlyon a remote computer or entirely on the remote computer or server. Inthe latter scenario, the remote computer may be connected to the user'scomputer through any type of network, including a local area network(LAN) or a wide area network (WAN), or the connection may be made to anexternal computer (for example, through the Internet using an InternetService Provider). In some embodiments, electronic circuitry including,for example, programmable logic circuitry, field-programmable gatearrays (FPGA), or programmable logic arrays (PLA) may execute thecomputer readable program instructions by utilizing state information ofthe computer readable program instructions to personalize the electroniccircuitry, in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a computer, or other programmable data processing apparatusto produce a machine, such that the instructions, which execute via theprocessor of the computer or other programmable data processingapparatus, create means for implementing the functions/acts specified inthe flowchart and/or block diagram block or blocks. These computerreadable program instructions may also be stored in a computer readablestorage medium that can direct a computer, a programmable dataprocessing apparatus, and/or other devices to function in a particularmanner, such that the computer readable storage medium havinginstructions stored therein comprises an article of manufactureincluding instructions which implement aspects of the function/actspecified in the flowchart and/or block diagram block or blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the blocks may occur out of theorder noted in the Figures. For example, two blocks shown in successionmay, in fact, be accomplished as one step, executed concurrently,substantially concurrently, in a partially or wholly temporallyoverlapping manner, or the blocks may sometimes be executed in thereverse order, depending upon the functionality involved. It will alsobe noted that each block of the block diagrams and/or flowchartillustration, and combinations of blocks in the block diagrams and/orflowchart illustration, can be implemented by special purposehardware-based systems that perform the specified functions or acts orcarry out combinations of special purpose hardware and computerinstructions.

Moreover, a system according to various embodiments may include aprocessor and logic integrated with and/or executable by the processor,the logic being configured to perform one or more of the process stepsrecited herein. By integrated with, what is meant is that the processorhas logic embedded therewith as hardware logic, such as an applicationspecific integrated circuit (ASIC), a field programmable gate array(FPGA), etc. By executable by the processor, what is meant is that thelogic is hardware logic; software logic such as firmware, part of anoperating system, part of an application program; etc., or somecombination of hardware and software logic that is accessible by theprocessor and configured to cause the processor to perform somefunctionality upon execution by the processor. Software logic may bestored on local and/or remote memory of any memory type, as known in theart. Any processor known in the art may be used, such as a softwareprocessor module and/or a hardware processor such as an ASIC, a FPGA, acentral processing unit (CPU), an integrated circuit (IC), a graphicsprocessing unit (GPU), etc.

It will be clear that the various features of the foregoing systemsand/or methodologies may be combined in any way, creating a plurality ofcombinations from the descriptions presented above.

The descriptions of the various embodiments of the present inventionhave been presented for purposes of illustration, but are not intendedto be exhaustive or limited to the embodiments disclosed. Manymodifications and variations will be apparent to those of ordinary skillin the art without departing from the scope and spirit of the describedembodiments. The terminology used herein was chosen to best explain theprinciples of the embodiments, the practical application or technicalimprovement over technologies found in the marketplace, or to enableothers of ordinary skill in the art to understand the embodimentsdisclosed herein.

FIG. 8 illustrates a network architecture 800, in accordance with oneapproach. As shown in FIG. 8, a plurality of remote networks 802 areprovided including a first remote network 804 and a second remotenetwork 806. A gateway 801 may be coupled between the remote networks802 and a proximate network 808. In the context of the present networkarchitecture 800, the networks 804, 806 may each take any formincluding, but not limited to a LAN, a WAN such as the Internet, publicswitched telephone network (PSTN), internal telephone network, etc.

In use, the gateway 801 serves as an entrance point from the remotenetworks 802 to the proximate network 808. As such, the gateway 801 mayfunction as a router, which is capable of directing a given packet ofdata that arrives at the gateway 801, and a switch, which furnishes theactual path in and out of the gateway 801 for a given packet.

Further included is at least one data server 814 coupled to theproximate network 808, and which is accessible from the remote networks802 via the gateway 801. It should be noted that the data server(s) 814may include any type of computing device/groupware. Coupled to each dataserver 814 is a plurality of user devices 816. Such user devices 816 mayinclude a desktop computer, laptop computer, handheld computer, printer,and/or any other type of logic-containing device. It should be notedthat a user device 811 may also be directly coupled to any of thenetworks, in some approaches.

A peripheral 820 or series of peripherals 820, e.g., facsimile machines,printers, scanners, hard disk drives, networked and/or local datastorage units or systems, etc., may be coupled to one or more of thenetworks 804, 806, 808. It should be noted that databases and/oradditional components may be utilized with, or integrated into, any typeof network element coupled to the networks 804, 806, 808. In the contextof the present description, a network element may refer to any componentof a network.

According to some approaches, methods and systems described herein maybe implemented with and/or on virtual systems and/or systems whichemulate one or more other systems, such as a UNIX system which virtuallyhosts a MICROSOFT WINDOWS environment, etc. This virtualization and/oremulation may be enhanced through the use of VMWARE software, in someapproaches.

In other approaches, one or more networks 804, 806, 808, may represent acluster of systems commonly referred to as a “cloud.” In cloudcomputing, shared resources, such as processing power, peripherals,software, data, servers, etc., are provided to any system in the cloudin an on-demand relationship, thereby allowing access and distributionof services across many computing systems. Cloud computing typicallyinvolves an Internet connection between the systems operating in thecloud, but other techniques of connecting the systems may also be used,as known in the art.

FIG. 9 shows a representative hardware environment associated with auser device 816 and/or server 814 of FIG. 8, in accordance with oneapproach. FIG. 9 illustrates a typical hardware configuration of aprocessor system 900 having a central processing unit 910, such as amicroprocessor, and a number of other units interconnected via a systembus 912, according to one approach. In some approaches, centralprocessing unit 910 may include any of the approaches described abovewith reference to the one or more processors 210 of FIG. 2.

The processor system 900 shown in FIG. 9 includes a Random Access Memory(RAM) 914, Read Only Memory (ROM) 916, and an I/O adapter 918. Accordingto some approaches, which are in no way intended to limit the invention,I/O adapter 918 may include any of the approaches described above withreference to I/O adapter 218 of FIG. 2. Referring still to processorsystem 900 of FIG. 9, the aforementioned components 914, 916, 918 may beused for connecting peripheral devices such as storage subsystem 920 tothe bus 912. In some approaches, storage subsystem 920 may include asimilar and/or the same configuration as data storage system 220 of FIG.2. According to an example, which is in no way intended to limit theinvention, storage subsystem 920 may include non-volatile data storagecards, e.g., having NVRAM memory cards, RAM, ROM, and/or some otherknown type of non-volatile memory, in addition to RAID controllers asillustrated in FIG. 2.

With continued reference to FIG. 9, a user interface adapter 922 forconnecting a keyboard 924, a mouse 926, a speaker 928, a microphone 932,and/or other user interface devices such as a touch screen, a digitalcamera (not shown), etc., to the bus 912.

Processor system 900 further includes a communication adapter 934 whichconnects the processor system 900 to a communication network 935 (e.g.,a data processing network) and a display adapter 936 which connects thebus 912 to a display device 938.

The processor system 900 may have resident thereon an operating systemsuch as the MICROSOFT WINDOWS Operating System (OS), a MAC OS, a UNIXOS, etc. It will be appreciated that a preferred approach may also beimplemented on platforms and operating systems other than thosementioned. A preferred approach may be written using JAVA, XML, C,and/or C++ language, or other programming languages, along with anobject oriented programming methodology. Object oriented programming(OOP), which has become increasingly used to develop complexapplications, may be used.

Moreover, FIG. 10 illustrates a storage system 1000 which implementshigh level (e.g., SSD) storage tiers in combination with lower level(e.g., magnetic tape) storage tiers, according to one approach. Notethat some of the elements shown in FIG. 10 may be implemented ashardware and/or software, according to various approaches. The storagesystem 1000 may include a storage system manager 1012 for communicatingwith a plurality of media on at least one higher storage tier 1002 andat least one lower storage tier 1006. However, in other approaches, astorage system manager 1012 may communicate with a plurality of media onat least one higher storage tier 1002, but no lower storage tier. Thehigher storage tier(s) 1002 preferably may include one or more randomaccess and/or direct access media 1004, such as hard disks, nonvolatilememory (NVM), NVRAM), solid state memory in SSDs, flash memory, SSDarrays, flash memory arrays, etc., and/or others noted herein or knownin the art. According to illustrative examples, FIGS. 3-4 show exemplaryarchitectures of SSD systems which may be used as a higher storage tier1002 depending on the desired approach.

Referring still to FIG. 10, the lower storage tier(s) 1006 preferablyincludes one or more lower performing storage media 1008, includingsequential access media such as magnetic tape in tape drives and/oroptical media, slower accessing HDDs, slower accessing SSDs, etc.,and/or others noted herein or known in the art. One or more additionalstorage tiers 1016 may include any combination of storage memory mediaas desired by a designer of the system 1000. Thus, the one or moreadditional storage tiers 1016 may, in some approaches, include a SSDsystem architecture similar or the same as those illustrated in FIGS.1-2. Also, any of the higher storage tiers 1002 and/or the lower storagetiers 1006 may include any combination of storage devices and/or storagemedia.

The storage system manager 1012 may communicate with the storage media1004, 1008 on the higher storage tier(s) 1002 and lower storage tier(s)1006 through a network 1010, such as a storage area network (SAN), asshown in FIG. 10, or some other suitable network type. The storagesystem manager 1012 may also communicate with one or more host systems(not shown) through a host interface 1014, which may or may not be apart of the storage system manager 1012. The storage system manager 1012and/or any other component of the storage system 1000 may be implementedin hardware and/or software, and may make use of a processor (not shown)for executing commands of a type known in the art, such as a centralprocessing unit (CPU), a field programmable gate array (FPGA), anapplication specific integrated circuit (ASIC), etc. Of course, anyarrangement of a storage system may be used, as will be apparent tothose of skill in the art upon reading the present description.

In more approaches, the storage system 1000 may include any number ofdata storage tiers, and may include the same or different storage memorymedia within each storage tier. For example, each data storage tier mayinclude the same type of storage memory media, such as HDDs, SSDs,sequential access media (tape in tape drives, optical disk in opticaldisk drives, etc.), direct access media (CD-ROM, DVD-ROM, etc.), or anycombination of media storage types. In one such configuration, a higherstorage tier 1002, may include a majority of SSD storage media forstoring data in a higher performing storage environment, and remainingstorage tiers, including lower storage tier 1006 and additional storagetiers 1016 may include any combination of SSDs, HDDs, tape drives, etc.,for storing data in a lower performing storage environment. In this way,more frequently accessed data, data having a higher priority, dataneeding to be accessed more quickly, etc., may be stored to the higherstorage tier 1002, while data not having one of these attributes may bestored to the additional storage tiers 1016, including lower storagetier 1006. Of course, one of skill in the art, upon reading the presentdescriptions, may devise many other combinations of storage media typesto implement into different storage schemes, according to the approachespresented herein.

According to some approaches, the storage system (such as 1000) mayinclude logic configured to receive a request to open a data set, logicconfigured to determine if the requested data set is stored to a lowerstorage tier 1006 of a tiered data storage system 1000 in multipleassociated portions, logic configured to move each associated portion ofthe requested data set to a higher storage tier 1002 of the tiered datastorage system 1000, and logic configured to assemble the requested dataset on the higher storage tier 1002 of the tiered data storage system1000 from the associated portions.

Of course, this logic may be implemented as a method on any deviceand/or system or as a computer program product, according to variousembodiments.

What is claimed is:
 1. A computer-implemented method, comprising:determining a current read heat value of each logical page whichcorresponds to write requests that have accumulated in a destage buffer;and assigning each of the write requests to a respective write queuebased on the current read heat value of each logical page whichcorresponds to the write requests, wherein each of the write queuescorrespond to a different page stripe which includes physical pages,wherein the physical pages included in each of the respective pagestripes are of a same type.
 2. The computer-implemented method of claim1, comprising: determining whether a given write queue includes enoughdata in the respective write requests to fill a next page stripe whichcorresponds thereto; in response to determining the given write queuedoes not include enough data in the respective write requests to fillthe next page stripe which corresponds thereto, determining whether anadjacent write queue includes enough data in the respective writerequests to complete filling the next page stripe which corresponds tothe given write queue; and destaging the data in the write requests fromthe given write queue and the adjacent write queue to the next pagestripe which corresponds to the given write queue in response todetermining that the adjacent write queue includes enough data in therespective write requests to complete filling the next page stripe whichcorresponds to the given write queue.
 3. The computer-implemented methodof claim 1, comprising: receiving a read request which corresponds todata stored in one or more logical pages; incrementing a read heat valueassociated with each of the one or more logical pages; and satisfyingthe read request.
 4. The computer-implemented method of claim 1,comprising: receiving host write requests; storing the host writerequests in the destage buffer; assigning each of the host writerequests in the destage buffer to a supplemental write queue; destagingdata in the host write requests from the supplemental write queue tophysical pages in any of the page stripes; and resetting the currentread heat values of logical pages which map to the physical pages thedata in the host write requests are destaged to.
 5. Thecomputer-implemented method of claim 1, wherein the physical pages areimplemented in quad-level cell (QLC) memory, wherein the types ofphysical pages include: lower pages, upper pages, extra pages, and toppages.
 6. The computer-implemented method of claim 1, wherein each ofthe current read heat values are maintained using a 2-bit saturatingcounter.
 7. A computer program product comprising a computer readablestorage medium having program instructions embodied therewith, theprogram instructions readable and/or executable by a processor to causethe processor to: determine, by the processor, a current read heat valueof each logical page which corresponds to write requests that haveaccumulated in a destage buffer; and assign, by the processor, each ofthe write requests to a respective write queue based on the current readheat value of each logical page which corresponds to the write requests,wherein each of the write queues correspond to a different page stripewhich includes physical pages, wherein the physical pages included ineach of the respective page stripes are of a same type.
 8. The computerprogram product of claim 7, wherein the program instructions arereadable and/or executable by the processor to cause the processor to:determine, by the processor, whether a given write queue includes enoughdata in the respective write requests to fill a next page stripe whichcorresponds thereto; in response to determining the given write queuedoes not include enough data in the respective write requests to fillthe next page stripe which corresponds thereto, determine, by theprocessor, whether an adjacent write queue includes enough data in therespective write requests to complete filling the next page stripe whichcorresponds to the given write queue; and destage, by the processor, thedata in the write requests from the given write queue and the adjacentwrite queue to the next page stripe which corresponds to the given writequeue in response to determining that the adjacent write queue includesenough data in the respective write requests to complete filling thenext page stripe which corresponds to the given write queue.
 9. Thecomputer program product of claim 7, the program instructions readableand/or executable by the processor to cause the processor to: receive,by the processor, a read request which corresponds to data stored in oneor more logical pages; increment, by the processor, a read heat valueassociated with each of the one or more logical pages; and satisfy, bythe processor, the read request.
 10. The computer program product ofclaim 7, the program instructions readable and/or executable by theprocessor to cause the processor to: receive, by the processor, hostwrite requests; store, by the processor, the host write requests in thedestage buffer; assign, by the processor, each of the host writerequests in the destage buffer to a supplemental write queue; destage,by the processor, data in the host write requests from the supplementalwrite queue to physical pages in any of the page stripes; and reset, bythe processor, the current read heat values of logical pages which mapto the physical pages the data in the host write requests are destagedto.
 11. The computer program product of claim 7, wherein the physicalpages are implemented in quad-level cell (QLC) memory, wherein the typesof physical pages include: lower pages, upper pages, extra pages, andtop pages.
 12. The computer program product of claim 7, wherein each ofthe current read heat values are maintained using a 2-bit saturatingcounter.
 13. A system, comprising: a plurality of non-volatile randomaccess memory (NVRAM) blocks configured to store data; and a processorand logic integrated with and/or executable by the processor, the logicbeing configured to: determine, by the processor, a current read heatvalue of each logical page which corresponds to write requests that haveaccumulated in a destage buffer; and assign, by the processor, each ofthe write requests to a respective write queue based on the current readheat value of each logical page which corresponds to the write requests,wherein each of the write queues correspond to a different page stripewhich includes physical pages, wherein the physical pages included ineach of the respective page stripes are of a same type.
 14. The systemof claim 13, the logic being configured to: determine, by the processor,whether a given write queue includes enough data in the respective writerequests to fill a next page stripe which corresponds thereto; inresponse to determining the given write queue does not include enoughdata in the respective write requests to fill the next page stripe whichcorresponds thereto, determine, by the processor, whether an adjacentwrite queue includes enough data in the respective write requests tocomplete filling the next page stripe which corresponds to the givenwrite queue; and destage, by the processor, the data in the writerequests from the given write queue and the adjacent write queue to thenext page stripe which corresponds to the given write queue in responseto determining that the adjacent write queue includes enough data in therespective write requests to complete filling the next page stripe whichcorresponds to the given write queue.
 15. The system of claim 13, thelogic being configured to: receive, by the processor, a read requestwhich corresponds to data stored in one or more logical pages;increment, by the processor, a read heat value associated with each ofthe one or more logical pages; and satisfy, by the processor, the readrequest.
 16. The system of claim 13, the logic being configured to:receive, by the processor, host write requests; store, by the processor,the host write requests in the destage buffer; assign, by the processor,each of the host write requests in the destage buffer to a supplementalwrite queue; destage, by the processor, data in the host write requestsfrom the supplemental write queue to physical pages in any of the pagestripes; and reset, by the processor, the current read heat values oflogical pages which map to the physical pages the data in the host writerequests are destaged to.
 17. The system of claim 13, wherein thephysical pages are implemented in quad-level cell (QLC) memory, whereinthe types of physical pages include: lower pages, upper pages, extrapages, and top pages.
 18. The system of claim 13, wherein each of thecurrent read heat values are maintained using a 2-bit saturatingcounter.